Isolated Non-Equilibrium Systems in Contact

We investigate a solvable model for energy conserving non-equilibrium steady states. The time-reversal asymmetry of the dynamics leads to the violation of detailed balance and to ergodicity breaking, as manifested by the presence of dynamically inaccessible states. Two such systems in contact do not reach the same effective temperature if standard definitions are used. However, we identify the effective temperature that controls energy flow. Although this operational temperature does reach a common value upon contact, the total entropy of the joint system can decrease.Comment: 4 pages, 3 figure

Revealing hidden scenes by photon-efficient occlusion-based opportunistic active imaging

The ability to see around corners, i.e., recover details of a hidden scene from its reflections in the surrounding environment, is of considerable interest in a wide range of applications. However, the diffuse nature of light reflected from typical surfaces leads to mixing of spatial information in the collected light, precluding useful scene reconstruction. Here, we employ a computational imaging technique that opportunistically exploits the presence of occluding objects, which obstruct probe-light propagation in the hidden scene, to undo the mixing and greatly improve scene recovery. Importantly, our technique obviates the need for the ultrafast time-of-flight measurements employed by most previous approaches to hidden-scene imaging. Moreover, it does so in a photon-efficient manner based on an accurate forward model and a computational algorithm that, together, respect the physics of three-bounce light propagation and single-photon detection. Using our methodology, we demonstrate reconstruction of hidden-surface reflectivity patterns in a meter-scale environment from non-time-resolved measurements. Ultimately, our technique represents an instance of a rich and promising new imaging modality with important potential implications for imaging science.Comment: Related theory in arXiv:1711.0629

Efficient data collection strategies for rapid learning in physical environments

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.Cataloged from student-submitted PDF version of thesis.Includes bibliographical references (pages 169-178).With the ubiquity of intelligent systems capable of sensing, inferring and acting upon their surroundings, it becomes critical to learn rapidly about unknown systems or environments. However, obtaining empirical data is often costly and involves setting up time consuming experiments or deploying specialized sensors. We are interested in deriving scalable algorithms and system architectures that facilitate efficient data collection, maximizing inference quality under limited resource budget. In this work, we consider efficient data collection strategies in several applications involving physical environments. We study the problem of learning dynamical systems with initial approximated models, where we prescribe methods for choosing near optimal experimental parameters to collect empirical data. We study the problem of antenna array topology design where we prescribe configurations allowing efficient scene inference under various measurement schemes and budget constraints. We introduce a novel nonlinear radar modality and discuss efficient design techniques for this setting. Finally, we introduce a novel methodology for optical imaging of non line of sight hidden scenes by utilizing occlusions and investigate how to achieve efficient illumination of the scene for fast hidden target interrogation.by Gal Shulkind.Ph. D

Sensor Array Design Through Submodular Optimization

© 1963-2012 IEEE. We consider the problem of far-field sensing by means of a sensor array. Traditional array geometry design techniques are agnostic to prior information about the far-field scene. However, in many applications such priors are available and may be utilized to design more efficient array topologies. We formulate the problem of array geometry design with scene prior as one of finding a sampling configuration that enables efficient inference, which turns out to be a combinatorial optimization problem. While generic combinatorial optimization problems are NP-hard and resist efficient solvers, we show how for array design problems the theory of submodular optimization may be utilized to obtain efficient algorithms that are guaranteed to achieve solutions within a constant approximation factor from the optimum. We leverage the connection between array design problems and submodular optimization and port several results of interest. We demonstrate efficient methods for designing arrays with constraints on the sensing aperture, as well as arrays respecting combinatorial placement constraints. This novel connection between array design and submodularity suggests the possibility for utilizing other insights and techniques from the growing body of literature on submodular optimization in the field of array design